Polyhedral Clinching Auctions for Two-Sided Markets

In this paper, we present a new model and mechanisms for auctions in two-sided markets of buyers sellers, where budget constraints are imposed on buyers. Our incorporates polymatroidal environments is applicable to variety models that include multiunit auctions, matching markets, reservation exchange markets. built the network flow by Lawler Martel. Additionally, they feature nice properties such as incentive compatibility buyers, individual rationality, Pareto optimality, strong balance. The first mechanism generalization polyhedral clinching auction Goel et al. one-sided second reduce-to-recover algorithm reduces market be one-sided, applies al., lifts resulting allocation original via flow. Both implemented polymatroid algorithms. We demonstrate how our framework applied Internet display advertisement auctions.